A Switching Approach to Avoid Breakdown in Lanczos-Type Algorithms
نویسندگان
چکیده
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in switching between different algorithms that have been generated using different recurrence relations between orthogonal polynomials. This approach can be implemented as three different strategies: ST1, ST2, and ST3. We shall briefly recall how Lanczos-type algorithms are derived. Four of the most prominent such algorithms namely A4, A12, A5/B10 and A5/B8 will be presented and then deployed in the switching framework. In this paper, only strategy ST2 will be investigated. Numerical results will be presented. 2010 Mathematics Subject Classification: 65F10
منابع مشابه
New look-ahead Lanczos-type algorithms for linear systems
A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos' method because of the non{existence of some formal orthogonal polynomials or because the recurrence relationship used is not appropriate. Such a breakdown can be avoided by jumping over the polynomials involved. This strategy was already used in some algorithms such as the MRZ and its variants. In this...
متن کاملA Breakdown-free Variation of the Nonsymmetric Lanczos Algorithms
The nonsymmetric Lanczos tridiagonalization algorithm is essentially the Gram-Schmidt biorthogonalization method for generating biorthogonal bases of a pair of Krylov subspaces. It suffers from breakdown and instability when a pivot at some step is zero or nearly zero, which is often the result of mismatch of the two Krylov subspaces. In this paper, we propose to modify one of the two Krylov su...
متن کاملLook-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
Lanczos-type product methods for solving large sparse non-Hermitian linear systems have as residual polynomials either the squares of the Lanczos polynomials or the products of the latter with another sequence of polynomials, which is normally chosen to enforce some local minimization of the residual norm. In either case, these methods inherit from the underlying Lanczos process the danger of b...
متن کاملTransmission switching cost modeling and determination candidate Lines for participation in joint energy and reserve markets
There is a great resolution calling for smart grids in recent years. Introduction of new technologies, that make the network flexible and controllable, is a main part of smart grid concept and a key factor to its success. Transmission network as a part of system network has drawn less attention. Transmission switching as a transmission service can release us from load shedding and remove the co...
متن کاملBreakdowns in the Computation of Orthogonal Polynomials
When computingrecursively the members of a family of formal orthogonal polynomials, a division by zero can occur, thus producing a breakdown in the algorithm which has to be stopped. In this paper, such breakdowns are analyzed in detail and classiied. It is also showed how to avoid them in some particular cases. Applications to Pad e approximation, extrapolation methods and Lanczos method for s...
متن کامل